The Smallest Self-dual Graphs in a Pseudosurface
نویسنده
چکیده
A proper embedding of a graph G in a pseudosurface P is an embedding in which the regions of the complement of G in P are homeomorphic to discs and pinchpoints of P correspond to vertices in G; we say that a proper embedding of G in P is self dual if there exists an isomorphism from G to its topological dual. We show that each graph that has a possibility of being self-dual embeddable in a pseudosurface must have at least thirteen edges, and we establish other criteria that such a graph must satisfy. We show that there are five possible graphs that meet these criteria. Using the definition of an algebraic dual graph given by Abrams and Slilaty, we determine by way of computer-powered methods that exactly two of these five graphs are selfdual embeddable in the pinched sphere (the quotient of the sphere modulo the identification of two distinct points). We also utilize a surgery of Edmonds to produce self-dual embeddings of these graphs in the projective plane. We also determine that exactly one of the five graphs has a self-dual embedding in the projective plane and not in the pinched sphere.
منابع مشابه
Algebraic characterizations of graph imbeddability in surfaces and pseudosurfaces
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we characterize when G can be imbedded in a closed, connected pseudosurface with the given specifications. The specifications for the pseudosurface are: the number of face-connected components, the number of pinches, the number of crosscaps and handles, and the dimension of the first Z2-homology group. Th...
متن کاملThe Structure of Self-dual Plane Graphs with Maximum Degree 4 Jack E. Graver and Elizabeth J. Hartung
Self-dual plane graphs have been studied extensively. C. A. B Smith and W. T. Tutte published A class of self-dual maps in 1950 [9]; in 1992, Archdeacon and Richter [1] described a method for constructing all self-dual plane graphs and a second construction was produced by Servatius and Christopher [5] in 1992. Both constructions are inductive. In this paper, we produce four templates from whic...
متن کاملSelf-dual Spherical Grids
Self-dual plane graphs have been studied extensively. C. A. B Smith and W. T. Tutte published A class of self-dual maps in 1950 [9]; in 1992, Archdeacon and Richter [1] described a method for constructing all self-dual plane graphs and a second construction was produced by Servatius and Christopher [5] in 1992. Both constructions are inductive. In this paper, we produce four templates from whic...
متن کاملGraphs with smallest forgotten index
The forgotten topological index of a molecular graph $G$ is defined as $F(G)=sum_{vin V(G)}d^{3}(v)$, where $d(u)$ denotes the degree of vertex $u$ in $G$. The first through the sixth smallest forgotten indices among all trees, the first through the third smallest forgotten indices among all connected graph with cyclomatic number $gamma=1,2$, the first through<br /...
متن کاملOn the saturation number of graphs
Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal if it cannot be extended to a larger matching in $G$. The cardinality of any smallest maximal matching in $G$ is the saturation number of $G$ and is denoted by $s(G)$. In this paper we study the saturation numbe...
متن کامل